On the Combinatorics of Projected Deformed Products
نویسندگان
چکیده
Die selbstständige und eigenhändige Anfertigung versichere ich an Eides statt. To my father who introduced me to computers and maths and to my mother who failed to prevent him.
منابع مشابه
Construction and Analysis of Projected Deformed Products
We introduce a deformed product construction for simple polytopes in terms of lowertriangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products such that specified faces (e.g. all the k-faces) are “strictly preserved” under projection. Thus, starting from an arbitrary neighborly simplicial (d−2)-polytope...
متن کاملNon-projectability of Polytope Skeleta
We investigate necessary conditions for the existence of projections of polytopes that preserve full k-skeleta. More precisely, given the combinatorics of a polytope and the dimension e of the target space, what are obstructions to the existence of a geometric realization of a polytope with the given combinatorial type such that a linear projection to e-space strictly preserves the k-skeleton. ...
متن کاملOn leap Zagreb indices of graphs
The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.
متن کاملThree-dimensional profilometry based on shift estimation of projected fringe patterns.
This paper presents a new approach to fringe pattern profilometry. In this paper, a generalized model describing the relationship between the projected fringe pattern and the deformed fringe pattern is derived, in which the projected fringe pattern can be arbitrary rather than being limited to being sinusoidal, as are those for the conventional approaches. Based on this model, what is believed ...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کامل